No Double Counting Semantics for Conditional Independence
نویسنده
چکیده
The main goal of this paper is to describe a new semantic for conditional independence in terms of no double counting of uncertain evidence. For ease of exposition, we use probability calculus to state all results. But the results generalize easily to any calculus that fits in the framework of valuation-based systems. Thus, the results described in this paper apply also, for example, to Dempster-Shafer’s (D-S) belief function theory, to Spohn’s epistemic beliefs theory, and to Zadeh’s possibility theory. The concept of independent (or distinct) evidence in D-S belief function theory is analogous to the concept of conditional independence for variables in probability theory.
منابع مشابه
Generalized Conditional Independence and Decomposition Cognizant Curvature: Implications for Function Optimization
We introduce conditional independence for real-valued set functions which generalizes probabilistic conditional independence. We show that a natural semantics of conditional independence is that of local modularity. Generalized conditional independence leads to a spectrum between two extremes: modular functions and functions without any local modularity. We develop a decomposition theory and re...
متن کاملGraphical Models for Nonlinear Distributed Estimation
Distributed estimation has advantages over centralized estimation in reducing communication bandwidth, distributing the processing load and improving system survivability. One important technical issue in designing distributed estimation architectures and algorithms is the proper treatment of dependent information. This paper presents graphical models to represent dependent information in gener...
متن کاملCounting in Team Semantics
We explore several counting constructs for logics with team semantics. Counting is an important task in numerous applications, but with a somewhat delicate relationship to logic. Team semantics on the other side is the mathematical basis of modern logics of dependence and independence, in which formulae are evaluated not for a single assignment of values to variables, but for a set of such assi...
متن کاملLogical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated. We utilize recent results concerning a complete axiomatization of stable conditional independence relative to discrete probability measures to derive perfect model properties of stable conditional independence struct...
متن کاملDouble Robust Semiparametric Efficient Tests for Distributional Treatment Effects under the Conditional Independence Assumption
This note describes methods to test for distributional treatment effects under the conditional independence assumption. The differences between latent outcome distributions are judged by testing hypotheses of distributional equality and stochastic dominance. Furthermore, semiparametric efficient versions of the test statistics are given. The latter test statistics are double robust, i.e., they ...
متن کامل